Dynamic segment routing mapping server for a multiprotocol label switching network

ABSTRACT

A dynamic SRMS (DSRMS) in a MPLS network generates unique segment identifiers for nodes of the network lacking segment identifiers (SIDs). The DSRMS receives network information from other nodes of the network that may include, for example, Internal Gateway Protocol (IGP) routing information, advertised prefix values for the nodes, and label values used in MPLS routing. The DSRMS analyzes the information and identifies nodes of the network that are not associated with a SID. For each identified node, the DSRMS generates a unique SID and then announces the SID to other nodes within the network. Generating the unique SID may include executing a hashing function using the IP address of the identified node as an input.

TECHNICAL FIELD

Embodiments of the present invention generally relate to systems andmethods for implementing a telecommunications network and morespecifically for instantiating a dynamic segment routing mapping serverin a Multiprotocol Label Switching network that generates unique segmentidentifiers for nodes of the network that otherwise lack suchidentifiers.

BACKGROUND

Telecommunication networks provide for the transmission of informationacross some distance through terrestrial, wireless or satellitecommunication networks, and often through combinations of such networks.Such communications may involve voice, data, or multimedia (e.g., videoor streaming video) information, among others. In some instances,telecommunication networks may use Multiprotocol Label Switching (MPLS)to route communication packets through the network. MPLS networksutilize labels rather than long network addresses to transmit packetsfrom device to device (or network node to node).

In one particular MPLS scheme, any label may be advertised and usedbetween nodes to transmit the packets between the nodes. In another MPLSscheme known as segment routing, each node within the network isassigned or given a unique label, referred to as a prefix segmentidentifier (SID). To facilitate routing, each prefix SID within anetwork is announced to the other nodes within the network. A packet maythen be routed to a particular node within the network by adding or“pushing” the corresponding prefix SID onto a routing stack of thepacket, and routing the packet through the network to reach the nodecorresponding to the prefix SID. Such routing may be performed accordingto various routing strategies including shortest path and equal costmultipath (ECMP) routing. When a given packet reaches the nodecorresponding to the prefix SID, the node may “pop” the prefix SID fromthe routing stack and, if another label is present, forward the packetin accordance with the next label. Alternatively, if no additionallabels are present, the node may consume or otherwise route the packetto an autonomous system (AS) or other network associated with the node.

In addition to routing based on prefix SIDs, segment routing can includerouting based on adjacency SIDs. An adjacency SID is locally unique to agiven node and identifies a specific link between the node and aneighboring node. A given node having multiple links to other nodes willtherefore have multiple adjacency SIDs, each of which corresponds to oneof the links. When routing a packet, a prefix SID may be followed by anadjacency SID in the routing stack to first route a packet to the nodecorresponding to the prefix SID and then to subsequently have the nodetransmit the packet along the link identified by the adjacency SID.

It is with these observations in mind, among others, that aspects of thepresent disclosure were conceived.

SUMMARY

In one aspect of the present disclosure, a network routing method isprovided. The method includes receiving Internet Protocol (IP) addressesat a computing device from components of a Multiprotocol Label Switching(MPLS) network, a subset of the IP addresses being unassociated with asegment identifier (SID) for routing communication packets in the MPLSnetwork. The method further includes analyzing the subset of IPaddresses to identify a router identifier (RID) IP address within thesubset of IP addresses, the RID IP address corresponding to a node ofthe MPLS network that may be included in a Label-Switched Path (LSP) ofthe MPLS network. A unique SID is then generated for the RID IP address.The unique SID and corresponding RID IP address is then announced as amatched pair for segment routing in the MPLS network using a singalingprotocol. For example, in certain implementations, the signalingprotocol may be Interior Gateway Protocol (IGP).

In certain implementations, generating the unique SID may includeexecuting a hashing function. For example, the hashing function mayreceive as input, the RID IP address.

Analyzing the subset of IP addresses to identify which IP addressescorrespond to RID IP addresses may occur in several ways. For example,in one implementation, a mask length of each IP address may be checkedto see if the mask length corresponds to a known mask length for RID IPaddresses. In another implementation, each IP address may be checked tosee if it lies within a range of known RID IP addresses. In still otherimplementations, the analysis may include determining a routing typesupported by a device associated with each IP address or determiningwhether each IP address is associated with an IGP Type Length Value(TLV).

In another aspect of the present disclosure, another method offacilitating routing within a telecommunications network is provided.The method includes receiving, at a computing device communicativelycoupled to the telecommunications network, network information includingan Internet Protocol (IP) address for a first node of thetelecommunications network. The computing device determines that thefirst node is not currently assigned a segment identifier (SID) for usein segment routing of packets to the first node from other nodes of thetelecommunications network. In response, the computing deviceautomatically generates a unique SID for the first node and announces,through a signaling protocol, the IP address with the unique SID of thefirst node to at least one second node of the telecommunicationsnetwork.

In yet another aspect of the present disclosure, a system for operatinga telecommunications network is provided. The system includes acomputing device communicatively couplable to the telecommunicationsnetwork. The computing device is configured to receive networkinformation including an Internet Protocol (IP) address for a first nodeof the telecommunications network and to determine that the first nodeis not currently assigned a segment identifier (SID) for use in segmentrouting of packets to the first node from other nodes of thetelecommunications network. The computing device is further configuredto generate a unique SID for the first node based on the networkinformation and to announce, through a signaling protocol, the IPaddress with the unique SID of the first node to at least one secondnode of the telecommunications network.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 schematic diagram illustrating an exemplary Voice over InternetProtocol (VoIP) operating environment in accordance with one embodiment.

FIG. 2 is a schematic diagram illustrating an exemplary networkenvironment utilizing a segment routing mapping server for MultiprotocolLabel Switching (MPLS) within the network.

FIG. 3 is a flowchart of a method for utilizing a dynamic segmentrouting mapping server in a MPLS network to generate unique segmentidentifiers for nodes of the network.

FIG. 4 is a flowchart of a method for identifying nodes in a MPLSnetwork that do not have a paired segment identifier and for generatinga unique segment identifier for the identified nodes for use in labeledrouting.

FIG. 5 is a diagram illustrating an example of a computing system whichmay be used in implementing embodiments of the present disclosure.

DETAILED DESCRIPTION

One potential issue with segment routing in a Multiprotocol LabelSwitching (MPLS) network is that not every device within the network maysupport segment routing. As a result, not every node may be assigned aunique segment identifier (SID) or label and/or may not be able toannounce such an identifier to other nodes in the network. In suchinstances, the network may include one or more segment routing mappingservers (SRMS). In general, a SRMS is a networking device thatadvertises to other nodes in the network static bindings of InternetProtocol (IP) addresses (which may be referred to as “prefixes”) andglobally unique SIDs. Thus, the SRMS may perform the announcing functionfor the nodes in the network that cannot advertise an SID. However,conventional SRMS devices require configuration during which eachprefix-SID pairing for every non-segment routing device in the networkis manually provided to the SRMS. While the manual configuration of anSRMS may be efficient in a small telecommunications network, largenetworks may require an administrator to enter and maintain severalthousand prefix-SID mapping entries in the SRMS. Such maintenance of themapping information in the SRMS is costly and time consuming.

In light of the foregoing, aspects of the present disclosure involvesystems, methods, computer program products, and the like, forinstantiating an SRMS in an MPLS network where the SRMS dynamicallygenerates unique segment identifiers for nodes of the network for whicha SID is unavailable. For purposes of the current disclosure, such anSRMS is referred to herein as a dynamic SRMS (DSRMS). In general, theDSRMS is a networking device that is a portion of a telecommunicationsnetwork and receives routing and other network information from nodes ofthe network. Such information may include, among other things, InternalGateway Protocol (IGP) routing information, advertised prefix values forthe nodes, and label values used in MPLS routing. The DSRMS analyzes theinformation to identify nodes of the network that require but have notbeen assigned a SID for purposes of segment routing. In other words, theDSRMS analyzes the received network information to determine if IPaddresses in the network information correspond to traffic handlingcomponents of the network (e.g., routers) for which SIDs are required.Such IP addresses are generally also referred to herein as routeridentifiers (RIDs). In one implementation, the DSRMS analyzes prefixesof the network information to determine if the prefix lies within arange of prefixes that are blocked as RIDs or otherwise known to beRIDs. The DSRMS may also analyze other information, such as anadvertised mask length, IGP Type Length Value (TLV) information, typesof routing protocols, and the like to determine which of the prefixes inthe received network information indicate an RID. In general, anyreceived network information may be analyzed to identify RIDs for nodesin the network. Although various aspects of the present disclosure maybe deployed in a DSRMS, it is possible to implement various aspects inany device that obtains or otherwise has access to the proper networkinformation and can communicate with the various nodes, directly orindirectly.

Once potential RIDs are identified, the DSRMS may auto-generate a uniqueSID for the identified RIDs. In one implementation, the DSRMS maycompute an SID value based on the received RID. In general, anycomputation for generating a unique SID, such as a hashing functionutilizing the RID as input, may be utilized by the DSRMS. Further, insome implementations, the generated SID may be compared to other SIDsutilized in the network to ensure that a SID is not used elsewherewithin the network or has otherwise been reserved for other purposes.Once the unique SID is generated, the DSRMS may advertise a SID-prefixmapping including each of the unique SIDs and the associated prefix toother nodes of the network. Following such announcement, the other nodeswithin the network may include the SID within header information of agiven packet to route the packet to the node associated with the prefixusing conventional segment routing practices. Notably, the samecomputation (e.g. the same hash function) for generating the unique SIDmay be executed by other DSRMS instances within the network to ensureuniformity of SID-prefix pairs across the network. In this manner, theDSRMS may automatically generate SID-prefix mappings or pairs for anetwork, thereby removing the need for manual maintenance required forconventional SRMS systems.

Beginning in FIG. 1, a typical telecommunications network configurationis shown. In particular, FIG. 1 is a schematic diagram illustrating anexemplary Voice over Internet Protocol (VoIP) operating environment 100in accordance with one embodiment. In general, the environment 100provides for establishing communication sessions between network usersand for providing one or more network services to network users. Withspecific reference to FIG. 1, the environment 100 includes a VoIPnetwork 102, which may be provided by a wholesale network serviceprovider. However, while the environment 100 of FIG. 1 shows aconfiguration using the VoIP network 102; it should be appreciated thatportions of the network may include non IP-based routing. For example,network 102 may include devices utilizing time division multiplexing(TDM) or plain old telephone service (POTS) switching. In general, thenetwork 102 of FIG. 1 may include any communication network devicesknown or hereafter developed.

The VoIP network 102 includes numerous components such as, but notlimited to gateways, routers, and registrars, which enable communicationand/or provides services across the VoIP network 102, but are not shownor described in detail here because those skilled in the art willreadily understand these components. More relevant to this descriptionis the interaction and communication between the VoIP network 102 andother entities, such as the one or more customer home or business localarea networks (LANs) 106, where a user of the network will connect withthe network.

Customer network 106 can include communication devices such as, but notlimited to, a personal computer or a telephone 110 connected to arouter/firewall 114. Although shown in FIG. 1 as computer 110, thecommunication devices may include any type of communication device thatreceives a multimedia signal, such as an audio, video or web-basedsignal, and presents that signal for use by a user of the communicationdevice. The communication and networking components of the customernetwork 106 enable a user at the customer network 106 to communicate viathe VoIP network 102 to other communication devices, such as anothercustomer network 126 and/or the Internet 142. Components of the customernetwork 106 are typically home- or business-based, but they can berelocated and may be designed for easy portability. For example, thecommunication device 110 may be wireless (e.g., cellular) telephone,smart phone, tablet or portable laptop computer. In some embodiments,multiple communication devices in diverse locations that are owned oroperated by a particular entity or customer may be connected through theVoIP network 102.

The customer network 106 typically connects to the VoIP network 102 viaa border network 122, such as one provided by an Internet ServiceProvider (ISP). The border network 122 is typically provided andmaintained by a business or organization such as a local telephonecompany or cable company. The border network 122 may providenetwork/communication-related services to their customers. In contrast,the communication device 120 accesses, and is accessed by, the VoIPnetwork 102 via a public switched telephone network (PSTN) 126 operatedby a local exchange carrier (LEC). Communication via any of the networkscan be wired, wireless, or any combination thereof. Additionally, theborder network 122 and PSTN 126 may communicate, in some embodiments,with the VoIP Network 102 through a provider edge 130,132. For ease ofinstruction, only three communication devices 110, 115, 120 are showncommunicating with the VoIP network 102; however, numerous such devices,and other devices, may be connected with the network, which is equippedto handle enormous numbers of simultaneous calls and/or other IP-basedcommunications.

An operator of the VoIP network 102 may configure the network in anymanner to facilitate the routing of communications through the network.For example, the network 102 may include a series of interconnectednetworking devices, such as routers and switches, that receive acommunication, analyze the communication to determine a destination, androute the communication to a connected networking device to get thecommunication closer to a destination or egress point (such as provideredge 131). To determine which routes through the network to utilize toroute a received communication or packet, components of the network mayreceive route information through one or more route announcing sessionsbetween the devices. These route announcing sessions provide Layer 3routing information between the components of the network and betweendifferent networks so that components of the telecommunications network102 and other networks may determine how to route received communicationpackets.

One particular example of the announcement of Layer 3 routinginformation occurs in a Border Gateway Protocol (BGP) announcement. Ingeneral, BGP information (or BGP session, BGP feed or BGP data) is atable of Internet Protocol (IP) prefixes which designate networkconnectivity between autonomous systems (AS) or separate networks. BGPinformation for a network route may include path (including next-hopinformation), network policies, and/or rule-sets for transmission alongthe path, among other information. The BGP feed may also includeInterior Gateway Protocol (IGP) information for network routes within anAutonomous System (AS) or network and/or other network information thatpertains to the transmission of content from the network. However, BGPinformation mainly describes routes used by the network 102 to connectto external networks or customers (such as border network 122 andvirtual cloud environment 142) while IGP information describes routesthrough the network to connect one provider edge (such as provider edge132) to another provider edge (such as provider edge 131) through atelecommunications network 102.

The VoIP network 102 is provided as an example to illustrate variousaspects of telecommunications relevant to the present disclosure.Implementations of the present disclosure are not limited to VoIPnetworks or networks for supporting VoIP functionality. Rather, theconcepts discussed herein are more generally applicable to exchangingand routing data through a telecommunications network between endpointsof the telecommunications network.

In one instance, the telecommunications network 102 may utilize MPLSrouting through the network. FIG. 2 is a schematic diagram illustratingan exemplary network environment 200 utilizing a Segment Routing MappingServer (SRMS) 222 for MPLS routing within the network 202. The networkenvironment 200 includes a telecommunications network 202 similar tothat described above with reference to FIG. 1. Further, a customernetwork or device 204 may connect to the network 202 for providingcommunication packets to the network for delivery to a destinationnetwork or device 220. As described above, the customer device 204provides packets to the network 202 through an edge device, such asingress edge device A 206. The packet includes destination information,such as an IP address for the destination network or device 220. Throughrouting information propagated through the network in BGP and IGPannouncements, edge device A 206 determines that destination network 220may be reached through egress edge device X 214 or egress edge device Y216. Edge device A 206 may also determine a shortest routing paththrough the network 202 to reach a selected one of the egress edgedevices 214, 216 and ultimately to the destination network 220. In thisembodiment, the route through the network 202 includes network device B208, network device C 210, and network device D 212. These devices (edgedevice A 206 through edge device X 214 or edge device Y 216) may definea Label-Switched Path (LSP) through the network 202. It should beappreciated, however, that any number and/or types of network devicesmay be included in the LSP through the network 202 and the configurationillustrated in FIG. 2 is merely an example configuration.

In MPLS networks that utilize segment routing, the nodes or componentsof the network may be assigned or announce a unique label used forrouting to that particular node. For example, edge device X 214 mayannounce a unique label “500”, edge device Y 216 may announce a uniquelabel “510”, and edge device Z 218 may announce a unique label “520”.Other devices within the network 202 may also announce a unique labelfor segment routing. More particularly, the unique label (also referredto as a Segment Identifier or “SID”) is paired with a router identifier(RID) that takes the form of an IP address (or “prefix”) for thatparticular device. Each SID is uniquely assigned to a prefix such thatother nodes within the network 202 may utilize the announced SID forroute communication packets along the LSP to the node associated withthe particular prefix. More specifically, following announcement, apacket may be routed to a node associated with a given prefix byincluding the corresponding SID of the prefix in a header of the packet.The packet is then routed through the network, such as by shortest pathrouting, equal cost multipath (ECMP) routing, or any other routingtechnique, to reach the prefix.

For example, edge device A 206 may select edge device X 214 forproviding a received packet to the destination network 220. To route thepacket, edge device A 206 applies label value “500” to the packet headerand transmits the packet to device B 208. Device B 208 reads the labeland, knowing that the packet is intended for edge device X 214 by theinclusion of the label value for edge device X 214, routes the packetdown the LSP, eventually reaching edge device X 214. As the packet isrouted to edge device X 214, the label value “500” is retained such thatintermediate devices between device B 208 and edge device X 214similarly know to route the packet to edge device X 214. When edgedevice X 214 receives the packet, edge device X 214 removes the labelvalue from the packet and utilizes the destination IP address of thepacket to transmit the packet to the destination network 220. Althoughthe foregoing example specifically used edge device X 214 as adestination prefix, it should be appreciated that the label valueinserted into the header of the packet may also correspond to anynode/prefix within the network 202.

In some network instances, devices within the network may not supportsegment routing and, as a result, may not be assigned a SID or otherwisesupport SID announcements for purposes of facilitating segment routing.For example, network devices configured with legacy label advertisementprotocols (such as Label Distribution Protocol (LDP)) may not supportunique SID announcements. To address this issue, the network 202 mayinclude one or more Segment Routing Mapping Servers (SRMS) 222 that actas a proxy server for such devices and that advertise unique SID labelson behalf of the devices. For example, assume that edge device Z 218does not support segment routing protocols for the SID label “520”assigned to the device. Rather, SRMS 222 may announce the SID-prefixpair for edge device Z 520 to the nodes of the network 202 for use inlabel routing packets to edge device Z 520. Nodes within the network 202may then utilize the SID for edge device Z 520 for routing within theMPLS.

Conventionally, an SRMS may be manually populated and maintained by anadministrator or operator of a network. Thus, a technician or othernetwork administrator must log into the SRMS and provide the SID-prefixpairs for the network such that each node may utilize the proper SID forlabel routing of a packet. However, in large networks, this process maybe time-consuming for the technician. Further, as networks evolve andgrow over time, the opportunity for a mistake in maintaining the tableof SID-prefix pairs increases, creating the potential for routing issueswithin the network resulting in lost or dropped packets.

To improve the efficiency and stability of the network 202, a DynamicSRMS (DSRMS) device 222 is described herein. In general, the DSRMS 222identifies which nodes within a network require but have not beenassigned a SID and then automatically generates and announces uniqueSIDs for such nodes. The network information provided to the DSRMS 222may include, among other things, information received at the DSRMS 222from nodes of the network through IGP and BGP announcements.Accordingly, the DSRMS 222 removes the need for a network technician tomanually maintain the SID-prefix table. By doing so, the DSRMS 222reduces the potential for errors in the SID-prefix table. In certainimplementations, the DSRMS 222 utilizes an function, such as a hashingfunction that uses a portion of the network information as an input, togenerate the unique SIDs. The DSRMS 222 may further conduct variouschecks to ensure that any generated SID is not utilized elsewhere withinthe network 202 or otherwise reserved. The function for generating theSID may be repeatable in that it generates the same SID when providedthe same input values. As a result, several DSRMS 222 devices may beimplemented within the network 202 to allow the MPLS network to scale orexpand as needed without having to regenerate or configure theSID-prefix table of the newly added or currently used DSRMS devices.

FIG. 3 is a flowchart of a method 300 for utilizing the DSRMS 222 of thenetwork 202 to generate unique SIDs for nodes of the network 202. Theoperations of the method 300 may thus be performed by a networkingdevice configured as a DSRMS. In one implementation, the DSRMS 222 is anapplication server or other networking device executing one or moreapplications that perform the operations described herein. Further,although illustrated in the network environment 200 of FIG. 2 as being asingle component of the network 202, it should be appreciated thatportions of the DSRMS 222 may be included in any number of devices ofthe network to perform any number of the operations of the method 300.

Beginning in operation 302, the DSRMS 222 receives IGP or other networkinformation from the nodes or devices of the network 202. In someimplementations, the DSRMS 222 receives IGP information transmittedthrough the network 202 that includes prefixes corresponding to variouscomponents of the network. For components that support segment routing,the network information may further include an SID or label valuecorresponding to such network components that may be used to label routea packet to the component or node. Prefixes or IP addresses thatidentify the components of the network 202 may also be referred to asrouter identifiers (RIDs). Thus, through the network information, theDSRMS 222 may determine which nodes of the MPLS network 202 areassociated with an SID-prefix pair and include those received pairs intoa table of mapped SID-prefix pairs.

In addition to receiving matched SID-prefix pairs as part of the networkinformation, the DSRMS 222 may receive prefixes that do not have acorresponding SID. For example, one or more IP addresses in the networkinformation may not identify a node but may rather be IP addresses forspecific ports of devices or virtual components of the network 202. Inaddition, some components may not support segment routing such that IPaddresses or prefixes may be announced without a corresponding SID.Thus, in operation 304, the DSRMS 222 may obtain prefixes of nodes orcomponents of the network 202 that do not have a corresponding SID andretain those prefixes as potential RIDs of those nodes or components.These prefixes may then be analyzed as described below to determine if aunique SID should be automatically generated for them by the DSRMS 222.

To begin generating unique SID-prefix pairs for non-paired nodes of thenetwork 202, the DSRMS 222 determines which of the received prefixes orIP addresses are potential RIDs in operation 306. To determine whichprefixes are RIDs, the DSRMS 222 analyzes the prefixes received in thenetwork information to identify which prefixes have characteristicsindicating that they are RIDs. For example, the network 202 may haveblocks of prefixes reserved for use as RIDs such that the DSRMS 222 maydetermine that a received prefix is an RID if the received prefixe fallswithin the range of prefixes of the reserved block. In anotherimplementation, the DSRMS 222 may identify RIDs based on a mask lengthof the received prefix. For example, an IP version 4 (IPv4)-type RIDtypically has a mask length of /32 while an IP version 6 (IPv6)-type RIDtypically has a mask lengths of /126. Thus, the DSRMS 222 may analyzethe received prefixes to determine a mask length of the prefixes andidentify those prefixes that have a mask length that suggests an RIDprefix. In general, any aspect of a received prefix may be analyzed bythe DSRMS 222 to determine whether the received prefix is a RID.

With the RIDs identified from the received network information, theDSRMS 222 generates a unique SID for each of the identified RIDs inoperation 308. In one particular implementation, the DSRMS 222 utilizesa hashing function to generate a unique SID from a corresponding RID. Ingeneral, however, any function to generate a unique SID for acorresponding RID may be utilized by the DSRMS 222. In certainimplementations, the function may be repeatable in that the functionwill always produce the same SID given a particular set of inputs. Insuch cases, multiple instances of the DSRMS 222 may be included in thenetwork, each of which may be configured to generate the same SID for agiven potential RID prefix. Thus, utilizing a repeatable hashingfunction from the potential RID prefix in the multiple DSRMS 222 of thenetwork 202 may ensure that the SID generated for a particular RIDprefix is unique to that prefix through the entirety of the MPLS network202.

In operation 310, each instance of the DSRMS 222 of the network 202 mayadvertise all SID-prefix pairs known by the DSRMS 222, including theautomatically generated SID-prefix pairs and the SID-prefix pairsreceived through the network information. In some implementations, theSID-prefix pairs may be announced through one or more IGP sessions withcomponents or nodes of the network 202, although any known or hereafterdeveloped signaling protocol may be utilized by the DSRMS 222 of thenetwork 202 to broadcast the generated and known SID-prefix pairs. Inthis manner, the DSRMS 222 may perform the traditional functions of theSRMS while also automatically identifying potential RIDs within thenetwork and generating unique SIDs for nodes in the network 202 that donot already have an associated unique SID. Through this auto-generationof the SIDs, the operation and maintenance of the network 202 may beimproved and become more efficient.

FIG. 4 is a flowchart of a method 400 for identifying nodes in a MPLSnetwork 202 that do not have a SID-prefix pair and for generating aunique SID for the identified nodes for use in labeled routing. Similarto the method 300 described above, operations of the method 400 of FIG.4 may be performed by a networking device configured as a DSRMS 222. Inthis method, the operations of identifying potential RIDs from thereceived prefixes in the IGP or other network information are describedin more detail. The operations of generating a unique SID for potentialRIDs are also further described below. The method 400 of FIG. 4 may beperformed by the DSRMS 222 after the network information (such as nodeprefixes, port prefixes, and other connectivity information) and thelabel routing information (such as known SID-prefix pairs and otherlabel routing values) have been received at the DSRMS 222. Further, itshould be appreciated that the method 400 of FIG. 4 is but one exampleof operations performed by the DSRMS 222 to automatically generate anSID for a received prefix. Other operations and other ordering of theoperations may also be executed by the DSRMS 222 to generate unique SIDsfor prefixes of the MPLS network 202.

Beginning in operation 402, the DSRMS 222 determines if a receivedprefix from the network information has a mapped or correlated SIDassociated with the prefix. As described above, some nodes or componentsof the network 202 may have a unique SID associated with the componentfor segment routing of packets to the particular node. Other components,however, may not announce such SID-prefix pairs but may instead simplyannounce one or more prefixes associated with the node. Thus, the DSRMS222 obtains a received prefix from the network information anddetermines if the prefix has a paired SID value. If the prefix has apaired SID value, an SID need not be generated for the particular prefixand the method ends at operation 404. However, if the particular prefixhas no paired SID, the DSRMS 222 may continue to operation 406.

In operation 406, the DSRMS 222 obtains a mask length of the prefix anddetermines if the mask length suggests that the prefix is a potentialRID. As mentioned above, a potential RID may, for example, include amask length of /32 for IPv4 packets and /126 for IPv6 packets. Throughthe mask length, the DSRMS 222 may determine that a given prefix islikely a RID. If the particular prefix has a mask length that does notmatch the typical RID mask length, the DSRMS 222 may disregard theprefix as not being an RID and continue on to operation 404 and end theinquiry into the particular prefix. However, if the prefix has a masklength that is a known RID mask length, the DSRMS 222 may continue tooperation 408 to determine if the prefix is within a known block ofRIDs. As explained above, some MPLS networks 202 may reserve blocks orranges of prefixes for RIDs of components of the network. Analysis ofthe received prefix may determine if the prefix is within the range ofknown RIDs. If the particular prefix is outside the known range of RIDs,the DSRMS 222 proceeds to operation 404 and assumes the prefix is not anRID. However, if the prefix is within the known RID block, the DSRMS 222may determine the prefix is a RID and may then generate a unique SIDnumber or value for the prefix.

As should be appreciated, the operations to identify potential RIDs maybe as inclusive as desired by a network administrator. Thus, somenetworks or DSRMS may be more inclusive in identifying potential RIDs toensure that all RIDs of the network are assigned a unique SID. Ingeneral, there is little additional cost to assigning a unique SID toprefixes that are not RIDs as those SIDs are simply unused by thenetwork during label routing. In other instances, however, the networkor DSRMS may be less inclusive and only generate unique SID values toprefixes that meet specific prefix criteria. In this manner, theidentification of potential RID prefixes within the network may be tunedto the desires and needs of a network administrator.

In operation 410, the DSRMS 222 generates a unique SID for the potentialRIDs identified in the above operations. In general, the DSRMS 222 mayutilize any suitable function to generate the unique SIDs for thepotential RIDs. In one particular example, the DSRMS 222 utilizes ahashing function that converts each potential RID into a unique SIDvalue. Typically, the function is repeatable such that the same uniqueSID may be generated at multiple DSRMS devices within the network 202 toavoid SID duplication. Although any hashing function may be utilized,one particular function may take the following form. First, the DSRMS222 may calculate log2 of the pool size (P) of identified potential RIDsand round up to the nearest integer value (B). Next, the rightmost Bbits of the particular potential RID are calculated for value N. Third,N mod P is used as the index for a hashing function to create apotential unique SID for the particular potential RID. Again, thisfunction is but one example of potential functions that may be utilizedby the DSRMS 222 to generate a unique SID value for a given potentialRID. Further, the hashing function may be performed by any number ofDSRMS 222 of the network 202 that each return the same unique SID valuefor the given potential RID.

In operation 412, the DSRMS 222 may compare the generated potentialunique SID for the particular RID to other received SID values from thenetwork. In other words, the DSRMS 222 may determine if the generatedSID is already assigned to a node of the network 202 and, thus, is notunique to the potential RID. If the generated SID is already assigned toa node, the DSRMS 222 may return to operation 410 and generate a new SIDfor the identified RID. In one example, the DSRMS 222 may simplyincrement or decrement the generated SID and continue comparing theincremented or decremented value to known SID values until a uniquevalue is found. Other functions may also be used to generate otherpotential SIDs for a given potential RID. Once a unique SID value forthe network 202 is found, the DSRMS 222 may continue to operation 414and advertise the generated SID as paired with the RID to the nodes orcomponents of the network 202. In this manner, the DSRMS 222 maygenerate a unique SID for prefixes received at the DSRMS and announce apaired SID-prefix to the nodes of the network 202 without anadministrator configuring the DSRMS manually.

Through the systems and methods described above, a DSRMS may be includedin a MPLS network that generates unique segment identifiers for nodes ofthe network without a previously associated mapped label value. Ingeneral, the DSRMS receives routing information from the nodes of thenetwork and analyzes the information to identify RID prefixes that maynot have an assigned SID. In general, any received network informationmay be analyzed to identify RIDs for nodes in the network. Oncepotential RIDs are identified, the DSRMS may auto-generate a unique SIDfor the identified prefixes. In one implementation, the DSRMS mayutilize a function to generate an SID value based on the receivedprefix, although any function for generating a unique SID. Once theunique SID-prefix matching is generated, the DSRMS may advertise themapping to the nodes of the network for use in MPLS routing ofcommunication packets to devices that do not typically support segmentrouting.

FIG. 5 is a block diagram illustrating an example of a computing deviceor computer system 500 which may be used in implementing the embodimentsof the components of the network disclosed above. For example, thecomputing system 500 of FIG. 5 may be the virtual router of the bridgediscussed above. The computer system (system) includes one or moreprocessors 502-506. Processors 502-506 may include one or more internallevels of cache (not shown) and a bus controller or bus interface unitto direct interaction with the processor bus 512. Processor bus 512,also known as the host bus or the front side bus, may be used to couplethe processors 502-506 with the system interface 514. System interface514 may be connected to the processor bus 512 to interface othercomponents of the system 500 with the processor bus 512. For example,system interface 514 may include a memory controller 518 for interfacinga main memory 516 with the processor bus 512. The main memory 516typically includes one or more memory cards and a control circuit (notshown). System interface 514 may also include an input/output (I/O)interface 520 to interface one or more I/O bridges or I/O devices withthe processor bus 512. One or more I/O controllers and/or I/O devicesmay be connected with the I/O bus 526, such as I/O controller 528 andI/O device 530, as illustrated. The system interface 514 may furtherinclude a bus controller 522 to interact with processor bus 512 and/orI/O bus 526.

I/O device 530 may also include an input device (not shown), such as analphanumeric input device, including alphanumeric and other keys forcommunicating information and/or command selections to the processors502-506. Another type of user input device includes cursor control, suchas a mouse, a trackball, or cursor direction keys for communicatingdirection information and command selections to the processors 502-506and for controlling cursor movement on the display device.

System 500 may include a dynamic storage device, referred to as mainmemory 516, or a random access memory (RAM) or other computer-readabledevices coupled to the processor bus 512 for storing information andinstructions to be executed by the processors 502-506. Main memory 516also may be used for storing temporary variables or other intermediateinformation during execution of instructions by the processors 502-506.System 500 may include a read only memory (ROM) and/or other staticstorage device coupled to the processor bus 512 for storing staticinformation and instructions for the processors 502-506. The system setforth in FIG. 5 is but one possible example of a computer system thatmay employ or be configured in accordance with aspects of the presentdisclosure.

According to one embodiment, the above techniques may be performed bycomputer system 500 in response to processor 504 executing one or moresequences of one or more instructions contained in main memory 516.These instructions may be read into main memory 516 from anothermachine-readable medium, such as a storage device. Execution of thesequences of instructions contained in main memory 516 may causeprocessors 502-506 to perform the process steps described herein. Inalternative embodiments, circuitry may be used in place of or incombination with the software instructions. Thus, embodiments of thepresent disclosure may include both hardware and software components.

A machine readable medium includes any mechanism for storing ortransmitting information in a form (e.g., software, processingapplication) readable by a machine (e.g., a computer). Such media maytake the form of, but is not limited to, non-volatile media and volatilemedia. Non-volatile media includes optical or magnetic disks. Volatilemedia includes dynamic memory, such as main memory 516. Common forms ofmachine-readable medium may include, but is not limited to, magneticstorage medium; optical storage medium (e.g., CD-ROM); magneto-opticalstorage medium; read only memory (ROM); random access memory (RAM);erasable programmable memory (e.g., EPROM and EEPROM); flash memory; orother types of medium suitable for storing electronic instructions.

Embodiments of the present disclosure include various steps, which aredescribed in this specification. The steps may be performed by hardwarecomponents or may be embodied in machine-executable instructions, whichmay be used to cause a general-purpose or special-purpose processorprogrammed with the instructions to perform the steps. Alternatively,the steps may be performed by a combination of hardware, software and/orfirmware.

The description above includes example systems, methods, techniques,instruction sequences, and/or computer program products that embodytechniques of the present disclosure. However, it is understood that thedescribed disclosure may be practiced without these specific details. Inthe present disclosure, the methods disclosed may be implemented as setsof instructions or software readable by a device. Further, it isunderstood that the specific order or hierarchy of steps in the methodsdisclosed are instances of example approaches. Based upon designpreferences, it is understood that the specific order or hierarchy ofsteps in the method can be rearranged while remaining within thedisclosed subject matter. The accompanying method claims presentelements of the various steps in a sample order, and are not necessarilymeant to be limited to the specific order or hierarchy presented.

It is believed that the present disclosure and many of its attendantadvantages should be understood by the foregoing description, and itshould be apparent that various changes may be made in the form,construction and arrangement of the components without departing fromthe disclosed subject matter or without sacrificing all of its materialadvantages. The form described is merely explanatory, and it is theintention of the following claims to encompass and include such changes.

While the present disclosure has been described with reference tovarious embodiments, it should be understood that these embodiments areillustrative and that the scope of the disclosure is not limited tothem. Many variations, modifications, additions, and improvements arepossible. More generally, embodiments in accordance with the presentdisclosure have been described in the context of particularimplementations. Functionality may be separated or combined in blocksdifferently in various embodiments of the disclosure or described withdifferent terminology. These and other variations, modifications,additions, and improvements may fall within the scope of the disclosureas defined in the claims that follow.

We claim:
 1. A network routing method comprising: receiving a pluralityof Internet Protocol (IP) addresses at a computing device from aplurality of components of a Multiprotocol Label Switching (MPLS)network, a subset of the plurality of IP addresses being unmapped to asegment identifier (SID) for routing communication packets in the MPLSnetwork; analyzing the subset of the plurality of IP addresses toidentify a router identifier (RID) IP address within the subset of theplurality of network IP addresses, the RID IP address corresponding to anode of the MPLS network that may be included in a Label-Switched Path(LSP) of the MPLS network; generating a unique SID for the RID IPaddress; and announcing, through a signaling protocol, the unique SIDand the RID IP address as a matched pair for segment routing in the MPLSnetwork.
 2. The method of claim 1, wherein generating the unique SID forthe RID IP address comprises executing a hashing function and the RID IPaddress is an input to the hashing function.
 3. The method of claim 2,wherein analyzing the subset of the plurality of IP addresses toidentify the RID IP address comprises at least one of: comparing a masklength of each of the plurality of IP addresses to a known mask lengthof RID IP addresses; or comparing each of the plurality of IP addressesto a known range of RID IP addresses, wherein the unique SID isgenerated if the mask length is equal to the known mask length or if theIP address is within the known range of RID IP addresses, respectively.4. The method of claim 1 wherein the signaling protocol for announcingthe unique SID and the RID IP address is an Interior Gateway Protocol(IGP).
 5. The method of claim 1, further comprising updating a table ofSID-IP address pairs of the telecommunications network maintained at thecomputing device to include the unique SID and RID IP address, whereinthe unique SID and the RID IP address are announced by announcing SID-IPaddress pairs stored in the table.
 6. A network routing methodcomprising: receiving, at a computing device communicatively coupled tothe telecommunications network, network information including anInternet Protocol (IP) address for a first node of thetelecommunications network; automatically generating, using thecomputing device, a unique segment identifier (SID) for the first nodewhen the first node is not otherwise assigned a SID for use in segmentrouting of packets to the first node from other nodes of thetelecommunications network; and announcing, by the computing device andthrough a signaling protocol, the IP address with the unique SID of thefirst node to at least one second node of the telecommunicationsnetwork.
 7. The method of claim 6, wherein the network informationfurther includes a plurality of IP addresses within thetelecommunications network, the plurality of IP addresses including theIP address of the first node, the method further comprising identifyinga set of the plurality of IP addresses wherein each IP address of theset of IP addresses is a router identifier (RID).
 8. The method of claim7, wherein identifying the set of IP addresses comprises, for each IPaddress of the plurality of IP addresses, determining the IP address ofthe plurality of IP addresses has particular a mask length.
 9. Themethod of claim 7, wherein identifying the set of IP addressescomprises, for each IP address of the plurality of IP addresses,determining the IP address of the plurality of IP addresses is within arange known of IP addresses assigned to a RID block.
 10. The method ofclaim 7, wherein identifying the set of IP addresses comprises, for eachIP address of the plurality of IP addresses, at least one of determiningthe IP address of the plurality of IP addresses is associated with anInterior Gateway Protocol (IGP) Type Length Value (TLV) or determiningthe IP address is associated with a device that supports a specificrouting protocol.
 11. The method of claim 6, wherein automaticallygenerating the unique SID for the first node comprises executing ahashing function using the IP address of the first node as an input tothe hashing function.
 12. The method of claim 6, wherein the signalingprotocol for announcing the IP address of the first node with the uniqueSID of the first node is Interior Gateway Protocol (IGP).
 13. A systemfor facilitating routing within a telecommunications network, the systemcomprising: a computing device communicatively couplable to thetelecommunications network, the computing device configured to:receiving network information including an Internet Protocol (IP)address for a first node of the telecommunications network; generate aunique segment identifier (SID) for the first node based on the networkinformation; and announce, through a signaling protocol, the IP addresswith the unique SID of the first node to at least one second node of thetelecommunications network.
 14. The system of claim 13, wherein thenetwork information further includes a plurality of IP addresses withinthe telecommunications network, the plurality of IP addresses includingthe IP address of the first node, and the computing device is furtherconfigured to identifying a set of the plurality of IP addresses whereineach IP address of the set of IP addresses is a router identifier (RID).15. The system of claim 14, wherein the computing device is configuredto identify the set of IP addresses by, for each IP address of theplurality of IP addresses, determining the IP address of the pluralityof IP addresses has a particular mask length.
 16. The system of claim14, wherein the computing device is configured to identify the set of IPaddresses by, for each IP address of the plurality of IP addresses,determining the IP address of the plurality of IP addresses is within arange known of IP addresses assigned to a RID block.
 17. The system ofclaim 14, wherein the computing device is configured to identify the setof IP addresses by, for each IP address of the plurality of IPaddresses, at least one of determining the IP address of the pluralityof IP addresses has a particular Interior Gateway Protocol (IGP) TypeLength Value (TLV) or determining the IP address is associated with adevice that supports a specific routing protocol.
 18. The system ofclaim 13, wherein the computing device is configure to generate theunique SID for the first node by executing a hashing function using theIP address of the first node as an input to the hashing function. Thesystem of claim 13, wherein the signaling protocol by which thecomputing device announces the IP address of the first node with theunique SID of the first node is Interior Gateway Protocol (IGP).
 20. Thesystem of claim 13, wherein the computing device is a first computingdevice, and the system further comprises at least one second computingdevice communicatively coupleable to the telecommunications network, theat least one second computing device configured to: generate the uniqueSID for the first node based on the network information; and announcethe IP address with the unique SID of the first node to the at least onesecond node of the telecommunications network.